We propose a new partial decoding algorithm for $m$-interleaved Reed--Solomon(IRS) codes that can decode, with high probability, a random error of relativeweight $1-R^{\frac{m}{m+1}}$ at all code rates $R$, in time polynomial in thecode length $n$. For $m>2$, this is an asymptotic improvement over the previousstate-of-the-art for all rates, and the first improvement for $R>1/3$ in thelast $20$ years. The method combines collaborative decoding of IRS codes withpower decoding up to the Johnson radius.
展开▼
机译：我们提出了一种用于$ m $交错的Reed-Solomon（IRS）码的新的部分解码算法，该算法可以以较高的概率解码相对权重$ 1-R ^ {\ frac {m} {m + 1}}的随机误差在所有代码率$ R $的情况下，$在代码长度$ n $的时间多项式中。对于$ m> 2 $，这是对所有费率的最新改进，并且是最近$ 20 $年以来$ R> 1/3 $的首次改进。该方法将IRS代码的协作解码与功率解码达到约翰逊半径相结合。
展开▼
